Parsing Constituents with Categorial Grammars
نویسنده
چکیده
{A parser based on Categorial Grammars is described. It is capable of parsing constituents independently, and employs a chart without top-down control. It can be used to impose contraints on the input, or to enquire about the possible nal compositions.
منابع مشابه
Incremental Interpretation of Categorial Grammar
The paper describes a parser for Categorial Grammar which provides fully word by word incremental interpretation. The parser does not require fragments of sentences to form constituents, and thereby avoids problems of spurious ambiguity. The paper includes a brief discussion of the relationship between basic Categorial Grammar and other formalisms such as HPSG, Dependency Grammar and the Lambek...
متن کاملSyntactic categories and types: Ajdukiewicz and modern categorial grammars
This essay confronts Ajdukiewicz’s approach to syntactic categories with modern categorial grammars, mainly AB-grammars (basic categorial grammars) and Lambek grammars, i.e. categorial grammars based on different versions of the Lambek calculus.
متن کاملAbstract Categorial Parsing as Linear Logic Programming
This paper shows how the parsing problem for general Abstract Categorial Grammars can be reduced to the provability problem for Multiplicative Exponential Linear Logic. It follows essentially a similar reduction by Kanazawa, who has shown how the parsing problem for second-order Abstract Categorial Grammars reduces to datalog queries.
متن کاملA Pregroup Toolbox for Parsing and Building Grammars of Natural Languages
Pregroup grammars are a mathematical formalism in the spirit of categorial grammars. They are close to logical formalisms like Lambek calculus but have a polynomial parsing algorithm. The paper presents a pregroup toolbox for parsing and building grammars of natural languages, including a parser that uses a tabular approch based on majority partial composition.
متن کاملEfficient Parsing for CCGs with Generalized Type-Raised Categories
A type of ‘non-traditional constituents’ motivates an extended class of Combinatory Categorial Grammars, CCGs with Generalized Type-Raised Categories (CCG-GTRC) involving variables. Although the class of standard CCGs is known to be polynomially parsable, unrestricted use of variables can destroy this essential requirement for a practical parser. This paper argues for polynomial parsability of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007